Group isomorphism problem
In abstract algebra, the group isomorphism problem is the decision problem of determining whether two given finite group presentations refer to isomorphic groups.
The isomorphism problem was formulated by Max Dehn,[1] and together with the word problem and conjugacy problem, is one of three fundamental decision problems in group theory he identified in 1911.[2] All three problems, formulated as ranging over all finitely presented groups, are undecidable. In the case of the isomorphism problem, this means that there does not exist a computer algorithm that takes two finite group presentations and decides whether or not the groups are isomorphic, regardless of how (finitely) much time is allowed for the algorithm to run and how (finitely) much memory is available. In fact the problem of deciding whether a finitely presented group is trivial is undecidable,[3] a consequence of the Adian–Rabin theorem due to Sergei Adian and Michael O. Rabin.
However, there are some classes of finitely presented groups for which the restriction of the isomorphism problem is known to be decidable. They include finitely generated abelian groups, finite groups, Gromov-hyperbolic groups[4], one-relator groups with non-trivial center[5], and two-generator one-relator groups with torsion[6].
The group isomorphism problem, restricted to the groups that are given by multiplication tables, can be reduced to a graph isomorphism problem but not vice versa.[7] Both have quasi-polynomial-time algorithms, the former since 1978 attributed to Robert Tarjan[8] and the latter since 2015 by László Babai.[9] A small but important improvement for the case p-groups of class 2 was obtained in 2023 by Xiaorui Sun.[10][7]
References
[edit]- ^ Dehn, Max (1911). "Über unendliche diskontinuierliche Gruppenn". Math. Ann. 71: 116–144. doi:10.1007/BF01456932. S2CID 123478582.
- ^ Magnus, Wilhelm; Karrass, Abraham & Solitar, Donald (1996). Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations (2nd ed.). New York: Dover Publications. pp. 24–29. ISBN 0486632814. Retrieved 14 October 2022 – via VDOC.PUB.
- ^ Miller, Charles F. III (1992). "Decision Problems for Groups—survey and Reflections" (PDF). In Baumslag, Gilbert; Miller, C. F. III (eds.). Algorithms and Classification in Combinatorial Group Theory. Mathematical Sciences Research Institute Publications. Vol. 23. New York: Springer-Verlag. pp. 1–59. doi:10.1007/978-1-4613-9730-4_1. ISBN 9781461397328. (See Corollary 3.4)
- ^ Dahmani, François; Guirardel, Vincent (2011). "The isomorphism problem for all hyperbolic groups". Geometric and Functional Analysis. 21 (2): 223–300. arXiv:1002.2590. doi:10.1007/s00039-011-0120-0. S2CID 115165062.
- ^ Pietrowski, Alfred (1974-06-01). "The isomorphism problem for one-relator groups with non-trivial centre". Mathematische Zeitschrift. 136 (2): 95–106. doi:10.1007/BF01214345. ISSN 1432-1823.
- ^ Pride, Stephen J. (1977). "The isomorphism problem for two-generator one-relator groups with torsion is solvable". Transactions of the American Mathematical Society. 227: 109–139. doi:10.1090/S0002-9947-1977-0430085-X. ISSN 0002-9947.
- ^ a b Hartnett, Kevin (23 June 2023). "Computer Scientists Inch Closer to Major Algorithmic Goal". Quanta Magazine.
- ^ Miller, Gary L. (1978). "On the nlog n isomorphism technique (A Preliminary Report)". Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78. ACM Press. pp. 51–58. doi:10.1145/800133.804331. ISBN 978-1-4503-7437-8.
- ^ Babai, László (January 9, 2017), Graph isomorphism update
- ^ Sun, Xiaorui (2023). "Faster Isomorphism for p-Groups of Class 2 and Exponent p". arXiv:2303.15412 [cs.DS].
- Johnson, D. L. (1997). Presentations of Groups (2nd ed.). Cambridge: Cambridge University Press. p. 49. doi:10.1017/CBO9781139168410. ISBN 0521372038.
 | This abstract algebra-related article is a stub. You can help Wikipedia by expanding it. |
 | This article about the history of mathematics is a stub. You can help Wikipedia by expanding it. |